Approximating Planar Rotations
نویسندگان
چکیده
منابع مشابه
On approximating planar metrics by tree metrics
We combine the results of Bartal [Proc. 37th FOCS, 1996, pp. 184–193] on probabilistic approximation of metric spaces by tree metrics, with those of Klein, Plotkin and Rao [Proc. 25th STOC, 1993, pp. 682–690] on decompositions of graphs without small Ks,s minors (such as planar graphs) to show that metrics induced by such graphs (with unit lengths on the edges) can be probabilistically approxim...
متن کاملApproximating k-center in planar graphs
We consider variants of the metric k-center problem. Imagine that you must choose locations for k firehouses in a city so as to minimize the maximum distance of a house from the nearest firehouse. An instance is specified by a graph with arbitrary nonnegative edge lengths, a set of vertices that can serve as firehouses (i.e., centers) and a set of vertices that represent houses. For general gra...
متن کاملApproximating the minimum hub cover problem on planar graphs
We study an approximation algorithm with a performance guarantee to solve a new NP-hard optimization problem on planar graphs. The problem, which is referred to as the minimum hub cover problem, has recently been introduced to the literature to improve query processing over large graph databases. Planar graphs also arise in various graph query processing applications, such as; biometric identif...
متن کاملApproximating the partition function of planar two-state spin systems
We consider the problem of approximating the partition function of the hard-core model on planar graphs of degree at most 4. We show that when the activity λ is sufficiently large, there is no fully polynomial randomised approximation scheme for evaluating the partition function unless NP = RP. The result extends to a nearby region of the parameter space in a more general two-state spin system ...
متن کاملApproximating Node-Weighted k-MST on Planar Graphs
We study the problem of finding a minimum weight connected subgraph spanning at least k vertices on planar, node-weighted graphs. We give a (4 + ε)-approximation algorithm for this problem. In the process, we use the recent LMP primal-dual 3-approximation for the node-weighted prize-collecting Steiner tree problem [4] and the Lagrangian relaxation [6]. In particular, we improve the procedure of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1999
ISSN: 0179-5376
DOI: 10.1007/pl00009409